Classical Verification of Quantum Computations

We present the first protocol allowing a classical computer to interactively verify result of an efficient quantum computation. achieve this by constructing measurement protocol, which enables verifier use prover as trusted device. The forces behave follows: must construct $n$ qubit state his choice, measure each in Hadamard or standard basis directed verifier, and report results verifier. soundness is enforced based on assumption that learning with errors problem computationally intractable for machines.